Computing the straight skeleton of a monotone polygon in O(n log n) time
نویسندگان
چکیده
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a simple algorithm for drawing the straight skeleton of a monotone polygon. The time and space complexities of our algorithm are O(nlogn) and O(n) respectively.
منابع مشابه
Straight Skeletons of Monotone Polygons
We study the characteristics of straight skeletons of strictly monotone polygonal chains, and use them to devise an algorithm for computing positively weighted straight skeletons of strictly monotone polygons. Our algorithm runs in O(n log n) time and O(n) space.
متن کاملFaster Reductions for Straight Skeletons to Motorcycle Graphs
We give an algorithm that reduces the straight skeleton to the motorcycle graph in O(n log n) time for (weakly) simple polygons and O(n(log n) logm) time for a planar straight line graph with m connected components. The current fastest algorithms for computing motorcycle graphs are an O(n ) time algorithm for non-degenerate cases and O(n ) for degenerate cases. Together with our algorithm this ...
متن کاملMonotone paths in planar convex subdivisions and polytopes∗
Consider a connected subdivision of the plane into n convex faces where every vertex is incident to at most ∆ edges. Then, starting from every vertex there is a path with at least Ω(log∆ n) edges that is monotone in some direction. This bound is the best possible. Consider now a connected subdivision of the plane into n convex faces where exactly k faces are unbounded. Then, there is a path wit...
متن کاملOptimal guarding of polygons and monotone chains
In this paper we study several problems concerning the guarding of a polygon or a x-monotone polygonal chain P with n vertices from a set of points lying on it. Our results are: (1) An O(n logn) time sequential algorithm for computing the shortest guarding boundary chain of a polygon P. (2) An O(n logn) time sequential algorithm for computing the smallest set of consecutive edges guarding a pol...
متن کاملMonotone Paths in Planar Convex Subdivisions
Consider a connected subdivision of the plane into n convex faces where every vertex is incident to at most ∆ edges. Then, starting from every vertex there is a path with at least Ω(log∆ n) edges that is monotone in some direction. This bound is the best possible. Consider now a connected subdivision of the plane into n convex faces where exactly k faces are unbounded. Then, there is a path wit...
متن کامل